An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated
نویسندگان
چکیده
منابع مشابه
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated
An important theme in computable model theory is the study of computable models of complete first-order theories. More precisely, given a complete firstorder theory T , one would like to know which models of T have computable copies and which do not. A special case of interest is when T is an א1-categorical theory. In this paper we are interested in computable models of א1-categorical theories....
متن کاملComputably Enumerable Reals and Uniformly Presentable Ideals
We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefix-free set of strings such that α = ∑ σ∈A 2 −|σ|. Note that ∑ σ∈A 2 −|σ| is precisely the measure of the set of reals that have a string in A as an initial segment. So we will simply abbreviate ∑ σ∈A 2 −|σ| by μ(A). It is know...
متن کاملA New Uncountably Categorical Group
We construct an uncountably categorical group with a geometry that is not locally modular. It is not possible to interpret a field in this group. We show the group is CM-trivial.
متن کاملA computably categorical structure whose expansion by a constant has infinite computable dimension
Cholak, Goncharov, Khoussainov, and Shore [J. Symbolic Logic 64 (1999) 13– 37] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov’s method of left and right operations. ∗Partially supported by an Alfred P. Sloan Doctoral Disserta...
متن کاملConstructive Models of Uncountably Categorical Theories
We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a nite language of binary predicates whose only constructive (or recursive) model is the prime model. 0. Introduction. E ective (or recursive) model theory studies to which degree constructions in model theory and algebra can be made e ective. A presentation of a countable model M is an isom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2006
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1143468311